Bounded concurrent timestamp systems using vector clocks
نویسندگان
چکیده
منابع مشابه
Distributed Testing of Concurrent Systems: Vector Clocks to the Rescue
The ioco relation has become a standard in model-based conformance testing. The co-ioco conformance relation is an extension of this relation to concurrent systems specified with true-concurrency models. This relation assumes a global control and observation of the system under test, which is not usually realistic in the case of physically distributed systems. Such systems can be partially obse...
متن کاملTimestamp synchronization of concurrent events
Supercomputing is a key technological pillar of modern science and engineering, indispensable for solving critical problems of high complexity. However, to effectively utilize the enormously complex large-scale computer systems available today, scientists and engineers need powerful and robust software development tools. One technique widely used by such tools is event tracing with a broad spec...
متن کاملResetting Vector Clocks in Distributed Systems
This paper establishes the necessary and sufficient condition for a correct clock resetting such that the functionality of vector clocks can be preserved. A clock reset protocol is presented with its applicability and limitation discussed. Our result indicates that for some applications, the potential of clock overflow can be completely prevented by carefully choosing the condition for initiati...
متن کاملPerformance Modeling of Distributed Timestamp Ordering: Perfect and Imperfect Clocks
This work presents a model of a distributed database system which provides the framework to study the performance of timestamp ordering concurrency control. Locking and timestamping are two popular approaches to concurrency control in database systems. Timestamp-based algorithms have been proposed to protect distributed databases from inconsistencies during concurrent access. In these algorithm...
متن کاملContext-Bounded Analysis of Concurrent Queue Systems
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finite-state recursive programs provided a process dequeues messages only when its local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2002
ISSN: 0004-5411,1557-735X
DOI: 10.1145/505241.505246